Feasible Computability and Resource Bounded Topology
نویسندگان
چکیده
منابع مشابه
Finitely Bounded Effective Computability
One of the most important property of the computability is the certainty. For example a set of natural numbers is computable if there is a Turing machine which decides certainly if a given natural number belongs to the set or not, and no wrong answers are tolerant. On the other hand, the finitely bounded computability discussed in this paper allows finitely many mistakes which can be eventually...
متن کاملTopology and Computability Thesis Proposal
In this thesis I will relate standard computability to computability of reals|and related spaces|and link these notions with denotational semantics of computer languages. The framework for the proposed study was worked out in collaboration with Steve Awodey, Lars Birkedal and Dana Scott. The rst section gives a motivation for our setup and indicates how standard computability ts in it. The subs...
متن کاملBounded functional interpretation and feasible analysis
In this article we study applications of the bounded functional interpretation to theories of feasible arithmetic and analysis. The main results show that the novel interpretation is sound for considerable generalizations of weak König’s lemma, even in the presence of very weak induction. Moreover, when combined with Cook and Urquhart’s variant of the functional interpretation, one obtains effe...
متن کاملThe Computability Problem in Algebraic Topology
At first, and this has been immediately noted, this result ensures the durability of the mathematical job, which is not inconsiderable. No finite “system", in the broadest sense of the term, can potentially cover the whole mathematical field. So it can be considered that Church and Turing have proved that mathematicians will always be able to discover new playing fields and their creativitywill...
متن کاملOn abstract resource semantics and computability logic
We show that the uniform validity is equivalent to the non-uniform validity for Blass’ semantics of [A game semantics for linear logic. Annals of Pure and Applied Logic 56 (1992) 183–220]. We present a shorter proof (than that of [G. Japaridze. The intuitionistic fragment of computability logic at the propositional level. Annals of Pure and Applied Logic 147 (2007), No.3, pp.187-227]) of the co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1995
ISSN: 0890-5401
DOI: 10.1006/inco.1995.1015